package two.chapter_4.c4_3;

import edu.princeton.cs.algs4.MinPQ;
import two.chapter_1.c1_3.LinkedQueue;
import two.chapter_1.c1_3.Queue;

/**
 * 最小生成树
 */
public abstract class MST {

    private EdgeWeightedGraph g;


    public MST(EdgeWeightedGraph g) {
        this.g = g;

    }

    /**
     * 最小生成树的所有边
     *
     * @return
     */
    public abstract Iterable<Edge> edges();

    /**
     * 最小生成树权重
     *
     * @return
     */
    public abstract double weight();

}
